A Polyhedral Frobenius Theorem with Applications to Integer Optimization
نویسندگان
چکیده
منابع مشابه
A Polyhedral Frobenius Theorem with Applications to Integer Optimization
We prove a representation theorem of projections of sets of integer points by an integer matrix W . Our result can be seen as a polyhedral analogue of several classical and recent results related to the Frobenius problem. Our result is motivated by a large class of non-linear integer optimization problems in variable dimension. Concretely, we aim to optimize f(Wx) over a set F = P ∩ Z, where f ...
متن کاملThe Single-leaf Frobenius Theorem with Applications
Using the notion of Levi form of a smooth distribution, we discuss the local and the global problem of existence of one horizontal section of a smooth vector bundle endowed with a horizontal distribution. The analysis will lead to the formulation of a “one-leaf” analogue of the classical Frobenius integrability theorem in elementary differential geometry. Several applications of the result will...
متن کاملPolyhedral and complexity studies in integer optimization, with applications to maintenance planning and location-routing problems
This thesis develops integer linear programming models for and studies the complexity of problems in the areas of maintenance optimization and location–routing. We study how well the polyhedra defined by the linear programming relaxation of the models approximate the convex hull of the integer feasible solutions. Four of the papers consider a series of maintenance decision problems whereas the ...
متن کاملA Frobenius theorem for Cartan geometries, with applications
The classical result on local orbits in geometric manifolds is Singer’s homogeneity theorem for Riemannian manifolds [1]: given a Riemannian manifold M , there exists k, depending on dimM , such that if every x, y ∈ M are related by an infinitesimal isometry of order k, thenM is locally homogeneous. An open subset U ⊆ M of a geometric manifold is locally homogeneous if for every x, x ∈ U , ther...
متن کاملPolyhedral approximation in mixed-integer convex optimization
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2015
ISSN: 0895-4801,1095-7146
DOI: 10.1137/14m0973694